-
1 infinite connectivity
1) Математика: бесконечная связность2) Макаров: бесконечносвязный -
2 infinite connectivity
English-russian dictionary of physics > infinite connectivity
-
3 infinite connectivity
матем.English-Russian scientific dictionary > infinite connectivity
-
4 of infinite connectivity
Большой англо-русский и русско-английский словарь > of infinite connectivity
-
5 of infinite connectivity
Англо-русский технический словарь > of infinite connectivity
-
6 of infinite connectivity
Математика: бесконечносвязныйУниверсальный англо-русский словарь > of infinite connectivity
-
7 connectivity
мат.number of connectivity —
-
8 infinite
1) бесконечный
2) безграничный
3) бесконечно большой
4) безмерный
5) бесконечно-удаленный
6) беспредельный
7) нефинитный
8) безграничность
– infinite delay
– infinite descent
– infinite dimensional
– infinite discontinuity
– infinite divisibility
– infinite graph
– infinite group
– infinite interval
– infinite medium
– infinite multiplicity
– infinite point
– infinite product
– infinite quantity
– infinite resolution
– infinite set
– infinite sheeted
– infinite source
– non-denumerably infinite
– of infinite connectivity
– simply infinite
– uncountably infinite
-
9 connectivity
-
10 бесконечносвязный
Большой англо-русский и русско-английский словарь > бесконечносвязный
-
11 domain
1) владение, имение2) территория, зона3) физ. домен4) область, сфера5) матем. область определения6) область, домен• -
12 number
1) число || числовой2) номер || нумеровать3) код числа4) количество5) колонцифра6) численность || считать, подсчитывать, исчислять8) числительное•a great number of — множество, большое количество
a number of — (целый) ряд, некоторое количество
- absolutely pseudoprime number - connectivity number - deficient number - edge attachment number - edge covering number - edge sensitivity number - expected sample number - general recursively irrational number - geodesic crossing number - integer number - integral number - internal stability number - international customer number - mass exchange number - mixed-radix number - Mohs hardness number - number of principal cotype - number of space dimensions - octonary number - one-digit number - one-figure number - one's complement number - rectilinear crossing number - recursively real number - serial number - Shore hardness number - strictly positive number - vertex covering numberwinding number of a curve with respect to the point — порядок кривой относительно точки (число оборотов вектора, соединяющего данную точку с точкой кривой при обходе кривой)
-
13 graph
1) график; диаграмма; кривая; номограмма2) граф3) лингв. вариант графемы•- acyclic graph
- alternating graph
- AND-OR graph
- bar graph - bipartite graph
- bunch graph
- Caley graph
- circuit-free graph
- circulant graph
- circular graph
- closed graph
- color graph
- complementary graph
- complete graph
- computation graph
- connected graph
- connectivity graph
- control flow graph
- data flow program graph
- data-flow graph - directed graph
- E-graph
- extremal graph
- finite graph
- flat graph
- flow graph
- game graph
- harward graph
- indirected graph
- infinite graph
- information graph
- irregular graph
- labeled graph
- line graph
- linear graph
- locally finite graph
- marked points graph
- monochromatic graph
- multidimensional graph
- N-chromatic graph
- network graph
- net graph
- node-symmetric graph
- object graph
- ordered graph
- oriented graph
- pattern graph
- planar graph
- processing graph
- product graph
- regular graph of degree N
- regular graph
- scene graph
- section graph
- signal-flow graph
- singular graph
- software graph
- spectral decision graph
- stacked bar graph
- stacked graph
- state graph
- strongly connected graph
- task graph
- total graph
- transaction graph
- transition graph
- tree graph
- two-dimensional graph
- undirected graph
- vertex-weighted graph
- weighted directed graph
- word graphEnglish-Russian dictionary of computer science and programming > graph
-
14 degree
1) градус2) матем. степень; порядок3) сорт, качество4) диплом5) степень, уровень; ступень•degrees to port — мор. градусы левого борта
degrees to starboard — мор. градусы правого борта
to some degree — до некоторой степени; в известной мере
См. также в других словарях:
Percolation threshold — is a mathematical term related to percolation theory, which is the formation of long range connectivity in random systems. In engineering and coffee making, percolation is the slow flow of fluids through porous media, but in the mathematics and… … Wikipedia
Menger's theorem — In the mathematical discipline of graph theory and related areas, Menger s theorem is a basic result about connectivity in finite undirected graphs. It was proved for edge connectivity and vertex connectivity by Karl Menger in 1927. The edge… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Mandelbrot set — Initial image of a Mandelbrot set zoom sequence with a continuously coloured environment … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Finite topological space — In mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space for which there are only finitely many points.While topology is mostly interesting only for… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… … Wikipedia
Connected space — For other uses, see Connection (disambiguation). Connected and disconnected subspaces of R² The green space A at top is simply connected whereas the blue space B below is not connected … Wikipedia
Zune — This article is about the digital media brand. For the AROS widget toolkit, see Zune (widget toolkit). Zune Manufacturer Microsoft Release date … Wikipedia
Nano brain — A nano brain[1] [1] is a conceptual device that executes massively parallel computing following the information processing principles of human brain. This machine assembly would serve as an intelligent decision making unit for the nano… … Wikipedia